exponential time algorithm

См. также в других словарях:

• Exponential time — In complexity theory, exponential time is the computation time of a problem where the time to complete the computation, m ( n ), is bounded by an exponential function of the problem size, n . In other words, as the size of the problem increases… …   Wikipedia

• Sub-exponential time — In computational complexity theory, sub exponential time algorithms are those that run in time greater than polynomial time ( super polynomial time ), but less than exponential time. One example is the best known, classical, algorithm for integer …   Wikipedia

• Time complexity — In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the size of the input to the problem. The time complexity of an algorithm is commonly expressed using big O… …   Wikipedia

• Exponential smoothing — is a technique that can be applied to time series data, either to produce smoothed data for presentation, or to make forecasts. The time series data themselves are a sequence of observations. The observed phenomenon may be an essentially random… …   Wikipedia

• Exponential decay — A quantity undergoing exponential decay. Larger decay constants make the quantity vanish much more rapidly. This plot shows decay for decay constants of 25, 5, 1, 1/5, and 1/25 for x from 0 to 5. A quantity is said to be subject to exponential… …   Wikipedia

• Pollard's lambda algorithm — In mathematics, specifically computational number theory and computational algebra, Pollard s lambda algorithm (aka Pollard s kangaroo algorithm, see Naming below) is an algorithm for solving the discrete logarithm. The algorithm was introduced… …   Wikipedia

• Exponential backoff — is an algorithm that uses feedback to multiplicatively decrease the rate of some process, in order to gradually find an acceptable rate. It is often used in network congestion avoidance to help determine the correct sending rate. For example, a… …   Wikipedia

• Exponential growth — The graph illustrates how exponential growth (green) surpasses both linear (red) and cubic (blue) growth.   Exponential growth …   Wikipedia

• Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… …   Wikipedia

• Exponential distribution — Not to be confused with the exponential families of probability distributions. Exponential Probability density function Cumulative distribution function para …   Wikipedia

• Time-evolving block decimation — The time evolving block decimation (TEBD) algorithm is a numerical scheme used to simulate one dimensional quantum many body systems, characterized by at most nearest neighbour interactions.It is dubbed Time evolving Block Decimation because it… …   Wikipedia